Reconstruction of Decomposable Discrete Sets from Four Projections
نویسنده
چکیده
In this paper we introduce the class of decomposable discrete sets and give a polynomial algorithm for reconstructing discrete sets of this class from four projections. It is also shown that the class of decomposable discrete sets is more general than the class S ′ 8 of hv-convex 8but not 4-connected discrete sets which was studied in [3]. As a consequence we also get that the reconstruction from four projections in S ′ 8 can be solved in O(mn) time.
منابع مشابه
A decomposition technique for reconstructing discrete sets from four projections
The reconstruction of discrete sets from four projections is in general an NP-hard problem. In this paper we study the class of decomposable discrete sets and give an efficient reconstruction algorithm for this class using four projections. It is also shown that an arbitrary discrete set which is Q-convex along the horizontal and vertical directions and consists of several components is decompo...
متن کاملReconstruction of Discrete Sets from Four Projections: Strong Decomposability
In this paper we introduce the class of strongly decomposable discrete sets and give an efficient algorithm for reconstructing discrete sets of this class from four projections. It is also shown that every Q-convex set (along the set of directions {x, y}) consisting of several components is strongly decomposable. As a consequence of strong decomposability we get that in a subclass of hv-convex ...
متن کاملDISCRETE TOMOGRAPHY AND FUZZY INTEGER PROGRAMMING
We study the problem of reconstructing binary images from four projections data in a fuzzy environment. Given the uncertainly projections,w e want to find a binary image that respects as best as possible these projections. We provide an iterative algorithm based on fuzzy integer programming and linear membership functions.
متن کاملOn the Ambiguity of Reconstructing hv-Convex Binary Matrices with Decomposable Configurations
Reconstructing binary matrices from their row, column, diagonal, and antidiagonal sums (also called projections) plays a central role in discrete tomography. One of the main difficulties in this task is that in certain cases the projections do not uniquely determine the binary matrix. This can yield an extremely large number of (sometimes very different) solutions. This ambiguity can be reduced...
متن کاملGeneration and Empirical Investigation of hv -Convex Discrete Sets
One of the basic problems in discrete tomography is the reconstruction of discrete sets from few projections. Assuming that the set to be reconstructed fulfils some geometrical properties is a commonly used technique to reduce the number of possibly many different solutions of the same reconstruction problem. Since the reconstruction from two projections in the class of so-called hv-convex sets...
متن کامل